Scalable kernel polynomial method for calculating transition rates
نویسندگان
چکیده
منابع مشابه
Calculating transition rates from durations of transition paths.
Calculating the kinetic rates for rare transitions is an important objective for molecular simulations. Here I prove equalities that relate the transition rates to the equilibrium free energy and the statistics of the transition paths. In particular, the durations of the transition paths within given intervals of the reaction coordinate provide the kinetic pre-factor in the rate formula. Based ...
متن کاملNonparametric Regression Estimation under Kernel Polynomial Model for Unstructured Data
The nonparametric estimation(NE) of kernel polynomial regression (KPR) model is a powerful tool to visually depict the effect of covariates on response variable, when there exist unstructured and heterogeneous data. In this paper we introduce KPR model that is the mixture of nonparametric regression models with bootstrap algorithm, which is considered in a heterogeneous and unstructured framewo...
متن کاملOn the effectiveness of Gamow’s method for calculating decay rates
We examine Gamow’s method for calculating the decay rate of a wave function initially located within a potential well. Using elementary techniques, we examine a very simple, exactly solvable model, in order to show why it is so reliable for calculating decay rates, in spite of its conceptual problems. We also discuss the regime of validity of the exponential decay law. Typeset using REVTEX Pres...
متن کاملModified Kernel Polynomial Method for Estimating Graph Spectra
The kernel polynomial method (KPM) is a standard tool in condensed matter physics to estimate the density of states for a quantum system. We use the KPM to instead estimate the eigenvalue densities of the normalized adjacency matrices of “natural” graphs. Because natural graph spectra often include high-multiplicity eigenvalues corresponding to certain motifs in the graph, we introduce a pre-pr...
متن کاملCalculating Polynomial Runtime Properties
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and calculating other properties of programs, including their runtime, maximum stack depth, and (relative) path time costs. In this paper we show how precise (not just big-O) polynomial bounds on such costs may be calcula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2013
ISSN: 1098-0121,1550-235X
DOI: 10.1103/physrevb.87.214106